Constructing Hadamard matrices from orthogonal designs

نویسندگان

  • Christos Koukouvinos
  • Jennifer Seberry
چکیده

The Hadamard conjecture is that Hadamard matrices exist for all orders 1,2, 4t where t 2 1 is an integer. We have obtained the following results which strongly support the conjecture: (i) Given any natural number q, there exists an Hadamard matrix of order 2 q for every s 2 [2log2 (q 3)]. (ii) Given any natural number q, there exists a regular symmetric Hadamard matrix with constant diagonal of order 226 q2 for s as before. A significant step towards proving the Hadamard conjecture would be proving "Given any natural number q and constant Co there exists a Hadamard matrix of order 2q for some c < co." We make steps toward proving the Hadamard conjecture by showing that "If there is an OD( 4pi S1, S2, S3, S4) and a set ofT-matrices of order t there is an OD(16pt; 4pts1 , 4pts2 , 4pts3, 4pts4). In particular, if there is an OD( 4pj p, p, p, p) and a set ofT-matrices of order t there is an OD{16p2t; 4p2t, 4p2t, 4p2t, 4p2t). Further, if there are Williamson matrices of order w there is a Hadamard matrix of 16p2tw." Currently the aforementioned matrices are known for p, t E {orders of Hadamard matrices, orders of conference matrices, 1 + 2"'10b26c , a, b, c non-negative integers, 1,3, ... ,71,75,77,81,85,87,91,93,95,99} or for all orders of t ~ 100 except possibly t E {73, 79, 83, 89, 97} plus other orders, and w for a number of infinite families. New Tsequences for lengths 35, 61, 71, 183 and 671 are given. This paper gives 36 new orders < 40,000 for which Hadamard matrices exist. The current paper lends support to the belief that c ~ 5.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of Nested (nearly) Orthogonal Designs for Computer Experiments

We propose several methods for constructing nested (nearly) orthogonal designs intended for multi-fidelity computer experiments. Such designs are two (nearly) orthogonal designs with one nested within the other. Our methods exploit nesting in such discrete structures as fractional factorial designs, Hadamard matrices, and rotation matrices. Examples are given illustrating the proposed methods.

متن کامل

Signed group orthogonal designs and their applications

Craigen introduced and studied signed group Hadamard matrices extensively in [1, 2]. Livinskyi [13], following Craigen’s lead, studied and provided a better estimate for the asymptotic existence of signed group Hadamard matrices and consequently improved the asymptotic existence of Hadamard matrices. In this paper, we introduce and study signed group orthogonal designs. The main results include...

متن کامل

Orthogonal designs from negacyclic matrices

We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices. We give results for all possible tuple for order 12, all but 3 for order 20 and all but 3 for order 28.

متن کامل

An Algorithm for Sequentially Constructing Non-Isomorphic Orthogonal Designs and its Applications

We propose an algorithm for sequentially constructing non-isomorphic orthogonal designs (including both regular and non-regular orthogonal designs). An essential element of the algorithm is using minimal column base to reduce the computations for determining isomorphism between any two designs. By using this algorithm, we obtain the complete catalogs of n k (k = 2; : : : ; n 1) two-level orthog...

متن کامل

Strongly amicable orthogonal designs and amicable Hadamard matrices

Amicable orthogonal designs have renewed interest because of their use in mobile communications. We show the existence of strong amicable orthogonal designs, AOD(n : 1, n − 1; 1, n − 1), for n = p + 1, p ≡ 3 (mod 4) a prime and for n = 2, n a non-negative integer in a form more suitable for communications. Unfortunately the existence of amicable Hadamard matrices is not enough to demonstrate th...

متن کامل

Amicable Hadamard matrices and amicable orthogonal designs

New constructions for amicable orthogonal designs are given. These new designs then give new amicable Hadamard matrices and new skew-Hadamard matrices. In particular we show that if p is the order of normalized amicable Hadamard matrices there are normalized amicable Hadamard matrices of order (p 1)u + 1, u > 0 an odd integer. Tables are given for the existence of amicable and skew-Hadamard mat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1992